Experiments with Polygonal and Polyhedral Resistive Structures
نویسندگان
چکیده
In this work the equivalent resistors of eight regular polygonal and five polyhedral resistive structures are studied experimentally. The structures were constructed using commercial precision resistors of 1.209 kΩ ±0.5 % and the resistances were measured using multimeters available in any physics laboratory. The resistance dependence of the polygonal structures with relation to the vertex number and its convergence was determined. For polyhedral structures the resistances were measured across nodes. We found that the experimental equivalent resistance for all the structures shows good concordance with the theoretical predictions. This experiment offers the opportunity to shows students the use of symmetry in physics.
منابع مشابه
A freeform shape optimization of complex structures represented by arbitrary polygonal or polyhedral meshes
In this paper we propose a new scheme for freeform shape optimization on arbitrary polygonal or polyhedral meshes. The approach consists of three main steps: (1) surface partitioning of polygonal meshes into different patches; (2) a new freeform perturbation scheme of using the Cox–de Boor basis function over arbitrary polygonal meshes, which supports multi-resolution shape optimization and doe...
متن کاملA family of mimetic finite difference methods on polygonal and polyhedral meshes
A family of inexpensive discretization schemes for diffusion problems on unstructured polygonal and polyhedral meshes is introduced. The material properties are described by a full tensor. The theoretical results are confirmed with numerical experiments.
متن کاملGeneralized Voronoi Diagrams on Polyhedral Terrains
We present an algorithm for computing exact shortest paths, and consequently distances, from a generalized source (point, segment, polygonal chain or polygonal region) on a polyhedral terrain in which polygonal chain or polygon obstacles are allowed. We also present algorithms for computing discrete Voronoi diagrams of a set of generalized sites (points, segments, polygonal chains or polygons) ...
متن کاملGeneralized Source Shortest Paths on Polyhedral Surfaces
We present an algorithm for computing shortest paths and distances from a single generalized source (point, segment, polygonal chain or polygon) to any query point on a possibly non-convex polyhedral surface. The algorithm also handles the case in which polygonal chain or polygon obstacles on the polyhedral surface are allowed. Moreover, it easily extends to the case of several generalized sour...
متن کاملPolyhedral Mesh Generation and A Treatise on Concave Geometrical Edges
Three methods are investigated to remove the concavity at the boundary edges and/or vertices during polyhedral mesh generation by a dual mesh method. The non-manifold elements insertion method is the first method examined. Concavity can be removed by inserting non-manifold surfaces along the concave edges and using them as an internal boundary before applying Delaunay mesh generation. Conical c...
متن کامل